MINIMALE UND OPTIMALE BLUMSCHE MASSE. = MESURES DE BLUM MINIMALES ET OPTIMALESWECHSUNG G.1975; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1975; VOL. 11; NO 10-12; PP. 673-679; ABS. ANGL. RUSSE; BIBL. 8 REF.; (INT. SYMP. DISKRETE MATH. ANWEND. MATH. KYBERN.; BERLIN; 1974)Conference Paper

CONCEPTION DES AUTOMATES REORGANISABLESPUPYREV EI.1981; AVTOM. TELEMEH.; ISSN 0005-2310; SUN; DA. 1981; NO 2; PP. 145-155; ABS. ENG; BIBL. 17 REF.Article

TRANSLATIONAL LEMMAS, POLYNOMIAL TIME AND (LOG N)³-SPACE.BOOK RV.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 3; PP. 215-226; BIBL. 14 REF.Article

TOWARD A MATHEMATICAL THEORY OF GRAPH-GENERATIVE SYSTEMS AND ITS APPLICATION.NG PA; BANG SY.1976; INFORM. SCI.; U.S.A.; DA. 1976; VOL. 11; NO 3; PP. 223-250; BIBL. 1 P.Article

AUTOMATE FONCTIONNELRYTTER W.1976; PRACE C.O. P.A.N.; POLSKA; DA. 1976; NO 229; PP. 1-73; ABS. ANGL. RUSSE; BIBL. 16 REF.Article

ON TIME VERSUS SPACE AND RELATED PROBLEMS.HOPCROFT J; PAUL W; VALIANT L et al.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 57-64; BIBL. 18 REF.Conference Paper

BESCHREIBUNG UND ENTSCHEIDBARKEIT. (BEITRAG ZUM BEGRIFF DER KOMPLEXITAET II). = CONCEPTION ET DECIDABILITE. CONTRIBUTION AU DOMAINE DE LA COMPLEXITE)KORNWACHS K; VON LUCADOU W.1976; GRUNDLAGENSTUD. KYBERN. U. GEISTESWISSENSCH.; DTSCH.; DA. 1976; VOL. 17; NO 3; PP. 79-86; BIBL. 7 REF.Article

ON THE CHARACTERIZATION OF CERTAIN CLASSES OF DEVELOPMENTAL LANGUAGES BY AUTOMATA.VON SOLMS SH.1975; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1975; VOL. 5; NO 2; PP. 125-132; BIBL. 7 REF.Article

SYNTHESE D'AUTOMATES DANS UN MILIEU DE CALCUL A CRYOTRONSBANDMAN OL.1972; AVTOMAT. VYCHISLIT. TEKH.; LATV. S.S.R.; DA. 1972; NO 5; PP. 20-30; BIBL. 15 REF.Serial Issue

RELATIONS BETWEEN DIAGONALIZATION, PROOF SYSTEMS, AND COMPLEXITY GAPSHARTMANIS J.1979; THEOR. COMPUTER SCI.; NLD; DA. 1979; VOL. 8; NO 2; PP. 239-253; BIBL. 9 REF.Article

RELATING REFINED SPACE COMPLEXITY CLASSES.SEIFERAS JI.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 1; PP. 100-129; BIBL. 1 P.Article

ON TAPE-BOUNDED COMPLEXITY CLASSES AND MULTI-HEAD FINITE AUTOMATA.SUDBOROUGH IH.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 138-144; BIBL. 12 REF.Conference Paper

RELATIONSHIPS BETWEEN PUSHDOUN AUTOMATA WITH COUNTERS AND COMPLEXITY CLASSES.MONIEN B.1975; MATH. SYST. THEORY; U.S.A.; DA. 1975; VOL. 9; NO 3; PP. 248-264; BIBL. 13 REF.Article

A NOTE ON TAPE BOUNDS FOR SLA LANGUAGE PROCESSING.HARTMANIS J; BERMAN L.1975; IN: ANNU. SYMP. FOUND. COMPUT. SCI. 16; BERKELEY, CALIF.; 1975; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1975; PP. 65-70; BIBL. 6 REF.Conference Paper

BESCHREIBURG VON ZEITKOMPLEXITAETSKLASSEN BEI TURINGMASCHINEN DURCH ANDERE AUTOMATENMODELLE. = DESCRIPTION DES CLASSES DE COMPLEXITE TEMPORELLE DES MACHINES DE TUERING AU MOYEN D'AUTRES MODELES D'AUTOMATESMONIEN B.1974; ELEKTRON. INFORM.-VERARBEIT. KYBERN.; DTSCH.; DA. 1974; VOL. 10; NO 1; PP. 37-51; ABS. ANGL. RUSSE; BIBL. 8 REF.Article

BORNE SUPERIEURE DE LA COMPLEXITE D'AUTOMATE FINI POUR UNE CLASSE DE SCHEMAS GENERATEURS AVEC DES OPERATIONS DE COMPLEMENTATION ET D'INTERSECTIONDANG ZUJ RUAN; TSEJTIN GS.1974; ZAP. NAUCH. SEMINAR. LENINGRAD. OTDEL. MAT. INST. V. A. STEKLOVA; S.S.S.R.; DA. 1974; VOL. 40; PP. 14-29; ABS. ANGL.; BIBL. 5 REF.Article

COMPLEXITY OF RECOGNITION IN INTERMEDIATE-LEVEL LANGUAGES.ROUNDS WC.1973; IN: ANNU. SYMP. SWITCHING AUTOM. THEORY. 14; IOWA CITY; 1973; NORTHRIDGE; INST. ELECTR. ELECTRON. ENG. INC.; DA. 1973; PP. 145-158; BIBL. 20 REF.Conference Paper

SOME TIME-SPACE TRADEOFF RESULTS CONCERNING SINGLE-TAPE AND OFFLINE TM'SIBARRA OH; MORAN S.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 388-394; BIBL. 6 REF.Article

RECURSIVE TURING MACHINES.SAVITCH WJ.1977; INTERNATION. J. COMPUTER MATH.; U.S.A.; DA. 1977; VOL. 6; NO 1; PP. 3-31; BIBL. 4 REF.Article

TECHNIQUES FOR SEPARATING SPACE COMPLEXITY CLASSES.SEIFERAS JI.1977; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1977; VOL. 14; NO 1; PP. 73-99; BIBL. 1 P. 1/2Article

ON THE MINIMAL COMPLEXITY OF COMPONENT-MACHINES FOR SELF-CORRECTING NETWORKS.PRIESE L.1976; J. CYBERN.; U.S.A.; DA. 1976; VOL. 5; NO 4; PP. 97-118; BIBL. 4 REF.Article

PRACTICAL DECIDABILITY.EHRENFEUCHT A.1975; J. COMPUTER SYST. SCI.; U.S.A.; DA. 1975; VOL. 11; NO 3; PP. 392-396; BIBL. 7 REF.Article

ON THE FINITE-VALUEDNESS PROBLEM FOR SEQUENTIAL MACHINESTAT HUNG CHAN; IBARRA OH.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 1; PP. 95-101; BIBL. 6 REF.Article

THE COMPLEXITY OF DECISION PROBLEMS FOR FINITE-TURN MULTICOUNTER MACHINESGURARI EM; IBARRA OH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 495-505; BIBL. 18 REF.Conference Paper

AN EFFECTIVE SIMULATION OF DETERMINISTIC PUSHDOWN AUTOMATA WITH MANY TWO-WAY AND ONE-WAY HEADSRYTTER W.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 5; PP. 234-236; BIBL. 3 REF.Article